Alternative Representations in Algebraic Problem Solving: When are Graphs Better Than Equations?
نویسندگان
چکیده
منابع مشابه
Alternative Representations for Algebraic Problem Solving: When Are Graphs Better Than Equations?
Successful algebraic problem solving entails adaptability of solution methods using different representations. Prior research has suggested that students are more likely to prefer symbolic solution methods (equations) over graphical ones, even when graphical methods should be more efficient. However, this research has not tested how representation format might affect solution success, and wheth...
متن کاملWhen two kinases are better than one
When two kinases are better than one V idal-Eychenié et al. describe how two protein kinases team up to respond to DNA damage at stalled replication forks. DNA-dependent protein kinase catalytic subunit (DNA-PKcs) promotes the repair of DNA double-strand breaks (DSBs) by nonhomologous end joining (NHEJ). The ATR kinase, on the other hand, initiates cell cycle arrest and DNA repair after recogni...
متن کاملWhen Three Heads Are Better Than Two
The present study investigated the effects of both group size and heterogeneity in relevant math skill on collaborative problem solving. Overall, triads demonstrated better reasoning and more effective cryptarithmetic problem solving than dyads and singletons. Importantly, triads outperformed the best individuals in a nominal groups analysis. Triads were also better able than dyads to take adva...
متن کاملConverging on a new role for analogy in problem solving and retrieval: when two problems are better than one.
People often fail to retrieve examples analogous to a current problem or situation. There is good evidence that comparing structurally matching cases facilitates subsequent analogical access. However, current approaches offer little at the time of memory search to promote retrieval of a routinely encoded analogous source. We adapted Gick and Holyoak's (1980, 1983) classic paradigm to investigat...
متن کاملWhen Are K + 1 Queries Better than K?
Let A be any nonrecursive set. For each k 0, we show that there are functions (k + 1)-truth-table reducible to A that are not k-weak-truth-table reducible to A; and we show that there are functions (k + 1)-Turing reducible to A that are not k-Turing reducible to A. Intuitively, this means that k + 1 queries to a nonrecursive oracle are strictly more useful than k queries to the same oracle (for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Problem Solving
سال: 2016
ISSN: 1932-6246
DOI: 10.7771/1932-6246.1181